Massive Parallelization for Random Linear Network Coding
نویسندگان
چکیده
In this paper, we propose a general-purpose graphics processing unit (GPGPU) based parallelization technique for random linear network coding (RLNC). RLNC is recognized as a useful tool for enhancing performance of networked systems, and several parallel implementation techniques have been proposed in the literature to overcome its high computation overhead. However, existing parallel methods cannot take full advantage of GPGPU technology on many occasions. Addressing this problem, we propose a new RLNC parallelization technique that can exploit GPGPU architectures in full. Our method exhibits as much as a 5x increase in throughput compared to existing parallel RLNC decoding schemes leveraging GPGPU.
منابع مشابه
A Suitable Coding Scheme for Broadband Power-line Communication
This paper introduces three coding strategies for using the Luby Transform (LT) code in a relay aided power-line communication scheme. In the first method, the relay decodes the received packets and re-encodes them for transmission towards the destination. In the second method, the relay only forwardes a random linear combination of its received packets towards the destination, while in the thi...
متن کاملOn Random Linear Network Coding for Butterfly Network
Random linear network coding is a feasible encoding tool for network coding, specially for the non-coherent network, and its performance is important in theory and application. In this letter, we study the performance of random linear network coding for the well-known butterfly network by analyzing the failure probabilities. We determine the failure probabilities of random linear network coding...
متن کاملEfficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that network coding mitigates peer/piece selection problems in P2P file sharing systems; however, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in P2P file sharing...
متن کاملThe Limitation of Random Network Coding
It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and we characterize all achievable rate of random linear network coding by a simple maximum flow...
متن کاملPerformance evaluation of random linear network coding using a Vandermonde matrix
This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparisons of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using a Vandermonde matrix can improve the network utilization fa...
متن کامل